Various Distributed Shortest Path Routing Strategies for Wireless Ad Hoc Networks
نویسندگان
چکیده
In this paper, we describe and compare several distributed greedy algorithms that produce sets of nodes that can be used to form the backbone of an ad hoc wireless network. The backbone produced is always a d-hop dominating, d-hop connected set and has a desirable “shortest path property”. The perfomance of these algorithms for various parameters are compared.
منابع مشابه
Routing Strategies for Wireless Sensor Networks
This paper evaluates three routing strategies for wireless sensor networks: source, shortest path, and hierarchical-geographical, which are the three most commonly employed by wireless ad-hoc and sensor networks algorithms. Source routing was selected because it does not require costly topology maintenance, while shortest path routing was chosen because of its simple discovery routing approach ...
متن کاملDistributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), these sets are also d-hop connected and has a desirable “shortest path property”. Routing via the backbone created is also discussed. The algorithm has a “constant-time” comp...
متن کاملSecuring AODV routing protocol against the black hole attack using Firefly algorithm
Mobile ad hoc networks are networks composed of wireless devices to create a network with the ability for self-organization. These networks are designed as a new generation of computer networks to satisfy some specific requirements and with features different from wired networks. These networks have no fixed communication infrastructure and for communication with other nodes the intermediate no...
متن کاملLEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks
A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...
متن کاملKinetic spanning trees for minimum-power routing in MANETs
A distributed kinetic spanning tree algorithm is proposed for routing in wireless mobile ad hoc networks. Assuming a piecewise linear motion model for the nodes, the sequence of shortest-path spanning trees is determined, valid until the time of the next node trajectory change. By computing the sequence of trees using one execution of the distributed routing algorithm, in contrast to computing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003